VNS/LDS+CP : A Hybrid Method for Constraint Optimization in Anytime Contexts
نویسندگان
چکیده
In many decision problems (planning, scheduling, resource allocation), the objective is to find a good solution which satisfies a set of hard (or imperative) constraints, and satisfies as well as possible a set of soft constraints expressing costs, utilities, preferences. Such problems can be referred to as Constraint Optimization Problems, and are often translated to Valued Constraint Satisfaction Problems (VCSP) [15]. The VCSP framework is an extension of the well known Constraint Satisfaction Problem framework (CSP) [12].
منابع مشابه
Solving Constraint Optimization Problems in Anytime Contexts
This paper presents a new hybrid method for solving constraint optimization problems in anytime contexts. Discrete optimization problems are modelled as Valued CSP. Our method (VNS/LDS+CP) combines a Variable Neighborhood Search and Limited Discrepancy Search with Constraint Propagation to efficiently guide the search. Experiments on the CELAR benchmarks demonstrate significant improvements ove...
متن کاملOn-line resources allocation for ATM networks with rerouting
We have developed an application for France Telecom R&D, which takes place in an ATM (Asynchronous Transfer Mode) network administration context. The problem consists in planning demands of connection over a period of one year. A new demand is accepted if both bandwidth requirements and quality of service are satisfied. The acceptance or the reject of a demand must be decided within at most one...
متن کاملIterative Decomposition Guided Variable Neighborhood Search for Graphical Model Energy Minimization
Graphical models factorize a global probability distribution/energy function as the product/sum of local functions. A major inference task, known as MAP in Markov Random Fields and MPE in Bayesian Networks, is to find a global assignment of all the variables with maximum a posteriori probability/minimum energy. A usual distinction on MAP solving methods is complete/incomplete, i.e. the ability ...
متن کاملAnytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP
We propose Hybrid Best First Search (HBFS), a search strategy for optimization problems that combines Best First Search (BFS) and Depth First Search (DFS). Like BFS, HBFS provides an anytime global lower bound on the optimum, while also providing anytime upper bounds, like DFS. Hence, it provides feedback on the progress of search and solution quality in the form of an optimality gap. In additi...
متن کاملScheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm
We study an assignment type resource-constrained project scheduling problem with resources being multi-skilled personnel to minimize the total staffing costs. We develop a hybrid Benders decomposition (HBD) algorithm that combines the complimentary strengths of both mixed-integer linear programming (MILP) and constraint programming (CP) to solve this NP-hard optimization problem. An effective c...
متن کامل